JAMES GAVER

On the Convergence of the Gaver-Stehfest Algorithm

The Gaver–Stehfest algorithm for numerical inversion of Laplace transform was developed in the late 1960s. Due to its simplicity and good performance it is becoming increasingly more popular in such diverse areas as geophysics, operations research and economics, financial and actuarial mathematics, computational physics, and chemistry. Despite the large number of applications and numerical stud...

James

a chair, he was the very picture of dejection. His small head was hanging, an obstreperous tuft of the coarse, sandy hair standing defiantly upright on the crown of it; his complexion was sallow and pasty, and not in any way enhanced by a sparse scattering of tiny yellow freckles, plainly visible at close view; his generous mouth drooped, like his head, the lips pale, but firmly closed. In his ...

Analyzing the Gaver—Lewis Pareto Process under an Extremal Perspective

Marta Ferreira 1,2,3,∗ and Helena Ferreira 4 1 Centro de Matemática da Universidade do Minho, Campus de Gualtar 4710-057 Braga, Portugal 2 Centro de Matemática Computacional e Estocástica, Departamento de Matemática-Instituto Superior Técnico Av. Rovisco Pais 1, 1049-001 Lisboa, Portugal 3 Centro de Estatística e Aplicações, Faculdade de Ciências, Universidade de Lisboa, 1749-016 Lisboa, Portug...

James Taylor

James bundles

We study cubical sets without degeneracies, which we call –sets. These sets arise naturally in a number of settings and they have a beautiful intrinsic geometry; in particular a –set C has an infinite family of associated –sets J (C), i = 1, 2, . . ., which we call James complexes. There are mock bundle projections pi : |J (C)| → |C| (which we call James bundles) defining classes in unstable co...